Cuckoo-Shrikes
نویسندگان
چکیده
منابع مشابه
Cuckoo Hashing
We present a simple and e cient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738 761, 1994). The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of th...
متن کاملPopulation structure of loggerhead shrikes in the California Channel Islands.
The loggerhead shrike (Lanius ludovicianus), a songbird that hunts like a small raptor, maintains breeding populations on seven of the eight California Channel Islands. One of the two subspecies, L. l. anthonyi, was described as having breeding populations on six of the islands while a second subspecies, L. l. mearnsi, was described as being endemic to San Clemente Island. Previous genetic stud...
متن کاملSettling Decisions and Heterospecific Social Information Use in Shrikes
Animals often settle near competitors, a behavior known as social attraction, which belies standard habitat selection theory. Two hypotheses account for these observations: individuals obtain Allee benefits mediated by the physical presence of a competitor, or they use successfully settled individual as a source of information indicating the location of high quality habitat. We evaluated these ...
متن کاملAdaptive Cuckoo Filters
We introduce the adaptive cuckoo filter (ACF), a data structure for approximate set membership that extends cuckoo filters by reacting to false positives, removing them for future queries. As an example application, in packet processing queries may correspond to flow identifiers, so a search for an element is likely to be followed by repeated searches for that element. Removing false positives ...
متن کاملCuckoo hashing: Further analysis
We consider cuckoo hashing as proposed by Pagh and Rodler in 2001. We show that the expected construction time of the hash table is O(n) as long as the two open addressing tables are each of size at least (1 + ǫ)n, where ǫ > 0 and n is the number of data points. Slightly improved bounds are obtained for various probabilities and constraints. The analysis rests on simple properties of branching ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Emu - Austral Ornithology
سال: 1919
ISSN: 0158-4197,1448-5540
DOI: 10.1071/mu919042